Near-perfect Token Distribution
نویسندگان
چکیده
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-perfect token distribution problem redistributes the tokens in a minimum number of steps, so that, at the end, no more than O(l) tokens reside at each node. (In perfect distribution, at the end, exactly one token resides at each node.) In this paper we present a simple algorithm that works for all extrovert graphs, a new property which we define and study. In terms of connectivity requirements, extrovert graphs are in-between expanders and compressors. Our results lead to an optimal solution for the near-perfect token distribution problem on almost all cubic graphs. The new solution is conceptually simpler than previous algorithms, and applies to graphs of minimum possible degree. *DEC Systems Research Center, 130 Lytton Ave, Palo Alto, CA. ^Department of Mathematics, Carnegie-Mellon University. A portion of this work was done while the author was visiting DEC SRC. Supported in part by NSF Grant CCR 0089112. ^Department of Computer Science, The Hebrew University. A portion of this work was done while the author was visiting DEC SRC. IBM Almaden Research Center, San Jose, CA, and The Weizmann Institute of Science, Rehovot, Israel.
منابع مشابه
Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H . We additionally require that H admits a perfect matching and assume that edges of H are embedded in the plane as segments. The goal is to compute the minimal number of intersecting edges in a p...
متن کاملEstimating the Parameters for Linking Unstandardized References with the Matrix Comparator
This paper discusses recent research on methods for estimating configuration parameters for the Matrix Comparator used for linking unstandardized or heterogeneously standardized references. The matrix comparator computes the aggregate similarity between the tokens (words) in a pair of references. The two most critical parameters for the matrix comparator for obtaining the best linking results a...
متن کاملAnalytical Modeling Of Rate-Based Overload Control With Token Bucket Traffic Shaping On Client Side
Providing multimedia services to users assumes perfect quality of transfer and modern processing equipment that involves need of development of new methods of the analysis and forecasting of functioning of a communication network. In the paper we investigate the problem of the overload that occurs on a SIP (Session Initiation Protocol) server. SIP overload mitigation is based on RBOC (Rate-base...
متن کاملLoad Balancing on the Hypercube and Shuue-exchange
Maintaining a balanced load is of fundamental importance on any parallel computer, since a strongly imbalanced load often leads to low processor utilization. This paper considers two load balancing operations: Balance and MultiBalance. The Balance operation corresponds to the token distribution problem considered by Peleg and Upfal 9] for certain expander networks. The MultiBalance operation ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 5 شماره
صفحات -
تاریخ انتشار 1992